METHODICAL APPROACHES TO SOLVING FINANCIAL PLANNING PROBLEMS AT DOMESTIC ENTERPRISES

Solving Motion Planning Problems

This work considers a family of motion planning problems with movable blocks. Such problem is defined by a maze grid occupied by immovable blocks (walls) and free squares. There are k movable blocks (stones) and k fixed goal squares. The man is a movable block that can traverse free squares and move stones between them. The problem goal is to move the stones from their initial positions to the ...

Solving Deductive Planning Problems

Two general, problematic aspects of deductive planning, namely, detecting unsolvable planning problems and solving a certain kind of postdiction problem, are investigated. The work is based on a resource oriented approach to reasoning about actions and change using a logic programming paradigm. We show that ordinary resolution methods are insuucient for solving these problems and propose progra...

Solving Time-Dependent Planning Problems

A planning problem is time-dependent, if the time spent planning affects the uti l i ty of the system's performance. In [Dean and Boddy, 1988], we define a framework for constructing solutions to time-dependent planning problems, called expectation-driven iterative refinement. In this paper, we analyze and solve a moderately complex time-dependent planning problem involving path planning for a ...

Solving Planning Problems by Partial

Solving railway line planning problems using a decomposition algorithm

The passenger line planning is a process of strategic long-term decision-making problem in the field of railway passenger planning. A line is a route between starting point and destination with certain stops, which has a certain frequency of train schedule. A new solution based on decomposition algorithm has been proposed in this paper, which is defined in a master problem and two sub problems....